Symbolic Computation and Complexity Theory Transcript of My Talk
نویسنده
چکیده
I gave talks at the conference Alan Turing’s Heritage: Logic, Computation & Complexity in Lyon, France on July 3, 2012, at the Pierre and Marie Curie University (UPMC) Paris 6, France on July 17, 2012, and at the Tenth Asian Symposium on Computer Mathematics (ASCM) in Beijing, China on October 26, 2012 on the complexity theoretic hardness of many problems that the discipline of symbolic computation tackles. Here is a brief transcript of part of those talks.
منابع مشابه
Finding the Symbolic Solution of a Geometric Optimization Problem through Numeric Computations
The discipline of symbolic computation goes back to be beginnings of computers, as early on scientists carried out symbolic (exact) and algebraic manipulation of polynomials and quantified formulas on early computers. The theory of NP-completeness has exposed many of the investigated problems hard in the worst case. As it turned out in the 1980s, an exception is the problem of polynomial factor...
متن کاملVictor Pan – My Research Journey
I have been working in Mathematics, Computational Mathematics, and Computer Science for more than five decades, facing research challenges and seeking new insights and novel methods. I was thrilled whenever I discovered new keys that opened challenging scientific locks, particularly when a single key opened a number of locks, as this was the case with my techniques of active operation/linear su...
متن کاملResearch Overview of Agnes Szanto
The general objectives of my research program are to develop efficient algorithms for problems in algebra and in differential algebra, to analyze the computational complexity of the algorithms and to implement them. The scope of my research has expanded over the years. Initially I studied the structure of associative algebras and their applications to factoring polynomials and integers. As a Ph...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملA New Approach to Detect Congestive Heart Failure Using Symbolic Dynamics Analysis of Electrocardiogram Signal
The aim of this study is to show that the measures derived from Electrocardiogram (ECG) signals many a time perform better than the same measures obtained from heart rate (HR) signals. A comparison was made to investigate how far the nonlinear symbolic dynamics approach helps to characterize the nonlinear properties of ECG signals and HR signals, and thereby discriminate between normal and cong...
متن کامل